Estimation of Elliptical Basis Function Parameters by the Em Algorithm with Application to Speaker Veriication (final Version) Paper No.: Tnna069
نویسندگان
چکیده
This paper proposes to incorporate full covariance matrices into the radial basis function (RBF) networks and to use the Expectation-Maximization (EM) algorithm to estimate the basis function parameters. The resulting networks, referred to as elliptical basis function (EBF) networks, are evaluated through a series of text-independent speaker veriication experiments involving 258 speakers from a phonetically balanced, continuous speech corpus (TIMIT). We propose a veriication procedure using RBF and EBF networks as speaker models and show that the networks are readily applicable to verifying speakers using LP-derived cepstral coeecients as features. Experimental results show that small EBF networks with basis function parameters estimated by the EM algorithm outperform the large RBF networks trained in the conventional approach. The results also show that the equal error rate achieved by the EBF networks is about two-third of that achieved by the VQ-based speaker models.
منابع مشابه
Maximum Likelihood Estimation of Elliptical Basis Function Parameters with Application to Speaker Verification
The use of the K-means algorithm and the K-nearest neighbor heuristic in estimating the radial basis function (RBF) parameters may produce sub-optimal performance when the input vectors contain correlated components. This paper proposes to overcome this problem by incorporating full covariance matrices into the RBF structure and to use the expectation-maximi-zation (EM) algorithm to estimate th...
متن کاملA Family of Skew-Slash Distributions and Estimation of its Parameters via an EM Algorithm
Abstract. In this paper, a family of skew-slash distributions is defined and investigated. We define the new family by the scale mixture of a skew-elliptically distributed random variable with the power of a uniform random variable. This family of distributions contains slash-elliptical and skew-slash distributions. We obtain the moments and some distributional properties of the new family of d...
متن کاملDetermining the Optimal Number of Clusters by an Extended RPCL Algorithm
Determining an appropriate number of clusters is a diicult yet important problem. The rival penalized competitive learning (RPCL) algorithm was designed to solve this problem. But its performance is not satisfactory when there are overlapped clusters or in the cases where the input vectors contain dependent components. This paper addresses this problem by incorporating full covariance matrices ...
متن کاملTBM Tunneling Construction Time with Respect to Learning Phase Period and Normal Phase Period
In every tunnel boring machine (TBM) tunneling project, there is an initial low production phase so-called the Learning Phase Period (LPP), in which low utilization is experienced and the operational parameters are adjusted to match the working conditions. LPP can be crucial in scheduling and evaluating the final project time and cost, especially for short tunnels for which it may constitute a ...
متن کاملOptimization of EBFN Architecture by an Improved RPCL Algorithm with Application to Speaker Veri cation
| Determining an appropriate number of clusters is a diicult but important problem. The rival penalized competitive learning (RPCL) algorithm was proposed to solve this problem. But its performance is not satisfactory when the input vectors contain dependent components. This paper addresses this problem by incorporating full covariance matrices into the original RPCL algorithm. The resulting al...
متن کامل